Shape Reconstruction with Delaunay Complex

نویسنده

  • Herbert Edelsbrunner
چکیده

The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algorithmic solutions proposed in the computer science literature that are based on the Delaunay complex of the points.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimation of Euler Characteristic from Point Data

Determination of the geometry and topology of a 3-dimensional body is an important problem appearing in Computer Aided Design, medical tomography, crystallography, molecular biology, etc. The methods used to address this problem depend on the form of input data. Let S be a finite set of sample points from a 3-dimensional body K ⊂ R. In applications one may need to estimate certain integral prop...

متن کامل

A Thinning Algorithm for Topologically Correct 3d Surface Reconstruction

The existing algorithms for 3D surface reconstruction from point clouds require objects with smooth surfaces and extremely dense samplings with no or only very few noise in order to guarantee a correct result. Moreover they can only be applied to single object reconstruction and not to segmentation of three or more regions. We have developed an alternative surface reconstruction method wich pre...

متن کامل

Topologically Correct 3D Surface Reconstruction and Segmentation from Noisy Samples

Existing theories on 3D surface reconstruction impose strong constraints on feasible object shapes and often require error-free measurements. Moreover these theories can often only be applied to binary segmentations, i.e. the separation of an object from its background. We use the Delaunay complex and α-shapes to prove that topologically correct segmentations can be obtained under much more rea...

متن کامل

A non-parametric approach to shape reconstruction from planar point sets through Delaunay filtering

In this paper, we present a fully automatic Delaunay based sculpting algorithm for approximating the shape of a finite set of points S in R2. The algorithm generates a relaxed Gabriel graph (RGG) that consists of most of the Gabriel edges and a few non-Gabriel edges induced by the Delaunay triangulation. Holes are characterized through a structural pattern called as body-arm formed by the Delau...

متن کامل

Shape Reconstruction and Recognition with Isolated Non-directional Cues

The paper investigates a hypothesis that our visual system groups visual cues based on how they form a surface, or more specifically triangulation derived from the visual cues. To test our hypothesis, we compare shape recognition with three different representations of visual cues: a set of isolated dots delineating the outline of the shape, a set of triangles obtained from Delaunay triangulati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998